Systematic Weight Pruning of DNNs using Alternating Direction Method of Multipliers
نویسندگان
چکیده
We present a systematic weight pruning framework of deep neural networks (DNNs) using the alternating direction method of multipliers (ADMM). We first formulate the weight pruning problem of DNNs as a constrained nonconvex optimization problem, and then adopt the ADMM framework for systematic weight pruning. We show that ADMM is highly suitable for weight pruning due to the computational efficiency it offers. We achieve a much higher compression ratio compared with prior work while maintaining the same test accuracy, together with a faster convergence rate.
منابع مشابه
Modified Convex Data Clustering Algorithm Based on Alternating Direction Method of Multipliers
Knowing the fact that the main weakness of the most standard methods including k-means and hierarchical data clustering is their sensitivity to initialization and trapping to local minima, this paper proposes a modification of convex data clustering in which there is no need to be peculiar about how to select initial values. Due to properly converting the task of optimization to an equivalent...
متن کاملDistributed Learning-to-Rank on Streaming Data using Alternating Direction Method of Multipliers
We show that Alternating Direction Method of Multipliers is an effective method for largescale learning-to-rank on multi-cores and clusters, especially in scenarios requiring joint distributed and streaming architectures.
متن کاملManaging Photovoltaic Generation Effect On Voltage Profile Using Distributed Algorithm
In this paper, a distributed method for reactive power management in a distribution system has been presented. The proposed method focuses on the voltage rise where the distribution systems are equipped with a considerable number of photovoltaic units. This paper proposes the alternating direction method of multipliers (ADMMs) approach for solving the optimal voltage control problem in a distri...
متن کاملSupervised Hashing with Deep Neural Networks
In this paper, we propose training very deep neural networks (DNNs) for supervised learning of hash codes. Existing methods in this context train relatively “shallow” networks limited by the issues arising in back propagation (e.g. vanishing gradients) as well as computational efficiency. We propose a novel and efficient training algorithm inspired by alternating direction method of multipliers...
متن کاملOn the O(1/t) convergence rate of Eckstein and Bertsekas’s generalized alternating direction method of multipliers
This note shows the O(1/t) convergence rate of Eckstein and Bertsekas’s generalized alternating direction method of multipliers in the context of convex minimization with linear constraints.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1802.05747 شماره
صفحات -
تاریخ انتشار 2018